Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(0,1,x) |
→ f(x,x,x) |
| 2: |
|
f(x,y,z) |
→ 2 |
| 3: |
|
0 |
→ 2 |
| 4: |
|
1 |
→ 2 |
| 5: |
|
g(x,x,y) |
→ y |
| 6: |
|
g(x,y,y) |
→ x |
|
There is one dependency pair:
The approximated dependency graph contains one SCC:
{7}.
-
Consider the SCC {7}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006